Learning to Divide and Conquer: Applying the L* Algorithm to Automate Assume-Guarantee Reasoning Corina S. P˘as˘areanu Perot Systems, NASA Ames Research Center, N269-230, Moffett Field, CA 94035, USA

Source URL: sp09.pbworks.com

Single Program, Multiple Data Programming for Hierarchical Computations by Amir Ashraf Kamil A dissertation submitted in partial satisfaction of the requirements for the degree of

Source URL: titanium.cs.berkeley.edu

• Concurrent computing
• Computing
• Parallel computing
• Computer programming
• Cray
• SPMD
• Unified Parallel C
• Divide and conquer algorithms
• Thread
• OpenMP
• Algorithm
• Cell

Small Discrete Fourier Transforms on GPUs S. Mitra and A. Srinivasan Dept. of Computer Science, Florida State University, Tallahassee, FL 32306, USA {mitra,asriniva}@cs.fsu.edu Abstract – Efficient implementations of t

Source URL: www.cs.fsu.edu

• Digital signal processing
• Fast Fourier transform
• Discrete Fourier transform
• FFTW
• Cooley–Tukey FFT algorithm
• CUDA
• Divide and conquer algorithm
• Parallel computing
• Multiplication algorithm
• Mathematical analysis
• Mathematics
• Fourier analysis

Automatic Synthesis of Out-of-Core Algorithms Yannis Klonatos Andres Nötzli Andrej Spielmann

Source URL: lara.epfl.ch

• Algorithm
• Mathematical logic
• Theoretical computer science
• Function
• Fold
• Stack
• Divide and conquer algorithm
• Mathematics
• Computing
• Algorithms

Maximum Independent Set for Intervals by Divide-Prune-and-Conquer Jack Snoeyink∗ Dept. of Computer Science UNC Chapel Hill Lemma 1 Let T be a recursion tree with k leaves and

Source URL: www.cccg.ca

• Order theory
• Topology
• Divide and conquer algorithm
• Independent set
• Algorithm
• Logarithm
• Interval tree
• Graph theory
• Mathematics
• Interval

Parallel Branch and Cut T.K. Ralphs∗ Revised January 17, 2006 Abstract We discuss the main issues that arise in parallelizing the well-known branch-andcut algorithm for solving mixed-integer linear programs. Designing

Source URL: coral.ie.lehigh.edu

• Combinatorial optimization
• Applied mathematics
• Linear programming
• Linear programming relaxation
• Algorithm
• Divide and conquer algorithm
• Heuristic function
• Branch and cut
• Branch and bound
• Mathematical optimization
• Mathematics
• Operations research

CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 A Framework for Multi-Core Implementations of Divide and Conquer Algorithms and its Application to the Convex Hull Problem ∗ Stefan N¨ aher

Source URL: cccg.ca

• Theoretical computer science
• Sorting algorithms
• Operations research
• Parallel computing
• Quicksort
• Science
• Algorithm
• Speedup
• Divide and conquer algorithm
• Mathematics
• Convex hull algorithms
• Applied mathematics

Branch, Cut, and Price: Sequential and Parallel ? T.K. Ralphs1 , L. Lad´anyi2 , and L.E. Trotter, Jr.3 1

Source URL: coral.ie.lehigh.edu

• Applied mathematics
• Combinatorial optimization
• Linear programming
• Linear programming relaxation
• COIN-OR
• Branch and cut
• Algorithm
• Divide and conquer algorithm
• Optimization problem
• Mathematical optimization
• Mathematics
• Operations research

Implementing Scalable Parallel Search Algorithms for Data-intensive Applications L. Lad´anyi1 , T. K. Ralphs?2 , and M. J. Saltzman3 1 Department of Mathematical Sciences, IBM T. J. Watson Research Center,

Source URL: coral.ie.lehigh.edu

• Applied mathematics
• Binary trees
• Linear programming
• Linear programming relaxation
• Relaxation
• Tree
• Divide and conquer algorithm
• Algorithm
• T-tree
• Mathematical optimization
• Mathematics
• Operations research

PDF Document

Source URL: cccg.ca

• Computer programming
• Sorting algorithms
• Theoretical computer science
• Quicksort
• Science
• Convex hull algorithms
• Speedup
• Algorithm
• Divide and conquer algorithm
• Computing
• Parallel computing
• Mathematics